Intersection representations of graphs by arcs
نویسندگان
چکیده
منابع مشابه
Intersection-Link Representations of Graphs
We consider drawings of graphs that contain dense subgraphs. We introduce intersection-link representations for such graphs, in which each vertex u is represented by a geometric object R(u) and each edge (u, v) is represented by the intersection between R(u) and R(v), if it belongs to a dense subgraph, or by a curve connecting the boundaries ofR(u) andR(v), otherwise. We study a notion of plana...
متن کاملIntersection representations of matrices by subtrees and unicycles on graphs
Consider a 0-1 matrix M(i,j) with columns C={c1, c2,..., cm}, and rows R, or – equivalently – a hypergraph M(R,C) having M as its adjacency matrix (where R are the vertices and C are the hyperedges). Denote ri={cj| cj∈C and M(i,j)=1}. We consider the following two problems: (a) Is there a graph H, with vertex set C, such that every vertex subgraph H(ri) of H is a tree and the intersection of ev...
متن کاملOn set intersection representations of graphs
The intersection dimension of a bipartite graph with respect to a type L is the smallest number t for which it is possible to assign sets Ax ⊆ {1, . . . , t} of labels to vertices x so that any two vertices x and y from different parts are adjacent if and only if |Ax ∩Ay| ∈ L. The weight of such a representation is the sum ∑x |Ax| over all vertices x. We exhibit explicit bipartite n×n graphs wh...
متن کاملSet intersection representations for almost all graphs
Two variations of set intersection representation are investigated and upper and lower bounds on the minimum number of labels with which a graph may be represented are found which hold for almost all graphs. Speciically, if k (G) is deened to be the minimum number of labels with which G may be represented using the rule that two vertices are adjacent if and only if they share at least k labels,...
متن کاملOn cycles in intersection graphs of rings
Let $R$ be a commutative ring with non-zero identity. We describe all $C_3$- and $C_4$-free intersection graph of non-trivial ideals of $R$ as well as $C_n$-free intersection graph when $R$ is a reduced ring. Also, we shall describe all complete, regular and $n$-claw-free intersection graphs. Finally, we shall prove that almost all Artin rings $R$ have Hamiltonian intersection graphs. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pacific Journal of Mathematics
سال: 1970
ISSN: 0030-8730,0030-8730
DOI: 10.2140/pjm.1970.34.501